package leetcode.offer_two_special.dp;

/**
 * [2,7,9,3,1]
 *
 * @author mazouri
 * @create 2021-09-18 20:13
 */
public class _89_rob {
    public int rob(int[] nums) {
        if (nums.length == 1) return nums[0];

        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0],nums[1]);

        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(nums[i] + dp[i - 2], dp[i - 1]);
        }
        return dp[nums.length - 1];
    }
}
